Hyperformulae, Parallel Deductions and Intersection Types
نویسندگان
چکیده
منابع مشابه
Intersection Types and Counting
We present a new approach to the following meta-problem: given a quantitative property of trees, design a type system such that the desired property for the tree generated by an infinitary ground λ -term corresponds to some property of a derivation of a type for this λ -term, in this type system. Our approach is presented in the particular case of the language finiteness problem for nondetermin...
متن کاملSession Types = Intersection Types + Union Types
We propose a semantically grounded theory of session types which relies on intersection and union types. We argue that intersection and union types are natural candidates for modeling branching points in session types and we show that the resulting theory overcomes some important defects of related behavioral theories. In particular, intersections and unions provide a native solution to the pro...
متن کاملIntersection Types and Computational Rules
The invariance of the meaning of a λ-term by reduction/expansion w.r.t. the considered computational rules is one of the minimal requirements one expects to hold for a λ-model. Being the intersection type systems a general framework for the study of semantic domains for the Lambda-calculus, the present paper provides a characterisation of “meaning invariance” in terms of characterisation result...
متن کاملIntersection Types and Bounded Polymorphism
Intersection types and bounded quantiication are complementary extensions of a rst-order programming language with subtyping. We deene a typed-calculus combining these extensions, illustrate its unusual properties, and develop basic proof-theoretic and semantic results leading to algorithms for subtyping and typechecking.
متن کاملIntersection Types and Lambda Theories
We illustrate the use of intersection types as a semantic tool for showing properties of the lattice of λ-theories. Relying on the notion of easy intersection type theory we successfully build a filter model in which the interpretation of an arbitrary simple easy term is any filter which can be described in an uniform way by a recursive predicate. This allows us to prove the consistency of a we...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2001
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(04)00172-0